Partial applicative theories and explicit substitutions
نویسندگان
چکیده
منابع مشابه
Partial Applicative Theories and Explicit Substitutions
Systems based on theories with partial self-application are relevant to the formalization of constructive mathematics and as a logical basis for functional programming languages. In the literature they are either presented in the form of partial combinatory logic or the partial calculus, and sometimes these two approaches are erroneously considered to be equivalent. In this paper we address som...
متن کاملApplicative Theories and Explicit Mathematics
[5] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [6] Solomon Feferman and Gerhard Jäger. Systems of explicit mathematics with non-constructive µ-operator. [9] Susumu Hayashi and Satoshi Kobayashi. A new formulation of Feferman's system of functions and classes and its relation to Frege structures.
متن کاملFrege Structures for Partial Applicative Theories
Due to strictness problems, usually the syntactical definition of Frege structures is conceived as a truth theory for total applicative theories. To investigate Frege structures in a partial framework we can follow two ways. First, simply by ignoring undefinedness in the truth definition. Second, by introducing of a certain notion of pointer. Both approaches are compatible with the traditional ...
متن کاملChoice in Applicative Theories
TAPP is a total applicative theory, conservative over intuitionistic arithmetic. In this paper, we first show that the same holds for TAPP + the choice principle EAC; then we generalize this to TAPP + inductive definitions. Finally, we use TAPP to show that P.Martin-Lofs basic extensional theory MLp is conservative over intuitionistic arithmetic. 1980 Mathematical Subject Classification: 03F50,...
متن کاملTotality in Applicative Theories
In this paper we study applicative theories of operations and numbers with (and without) the non-constructive minimum operator in the context of a total application operation. We determine the proof-theoretic strength of such theories by relating them to well-known systems like Peano Arithmetic PA and the system ((0 1-CA) <"0 of second order arithmetic. Essential use will be made of so-called x...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1996
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/6.1.57